On some packing problem related to dynamic storage allocation
نویسندگان
چکیده
منابع مشابه
Finite size scaling approach to dynamic storage allocation problem
It is demonstrated how dynamic storage allocation algorithms can be analyzed in terms of finite size scaling. The method is illustrated in the three simple cases of the first-fit, next-fit and best-fit algorithms, and the system works at full capacity. The analysis is done from two different points of view running speed and employed memory. In both cases, and for all algorithms, it is shown tha...
متن کاملApproximation Algorithms and Heuristics for the Dynamic Storage Allocation Problem
In this report, we look at the problem of packing a number of arrays in memory efficiently. This is known as the dynamic storage allocation problem (DSA) and it is known to be NP-complete. We develop some simple, polynomial-time approximation algorithms with the best of them achieving a bound of 4 for a subclass of DSA instances. We report on an extensive experimental study on the FirstFit heur...
متن کاملGeneralized Dynamic Storage Allocation
Dynamic Storage Allocation is a problem concerned with storing items that each have weight and time restrictions. Approximate algorithms have been constructed through online coloring of interval graphs. We present a generalization that uses online coloring of tolerance graphs. We utilize online-with-representation algorithms on tolerance graphs, which are online algorithms in which the correspo...
متن کاملSpecialized Hardware Support for Dynamic Storage Allocation
SPECIALIZED HARDWARE SUPPORT FOR DYNAMIC STORAGE ALLOCATION by Steven M. Donahue ADVISOR: Dr. Ron K. Cytron May, 2003 Saint Louis, Missouri With the advent of operating systems and programming languages that can evaluate and guarantee real-time specifications, applications with real-time requirements can be authored in higher-level languages. For example, a version of Java suitable for real-tim...
متن کاملDynamic Storage Allocation on a Computer with Virtual Memory
We compare several dynamic storage strategies under the assumption that they will be used on a computer with virtual memory. On such a computer the total (virtual) memory referenced by a process may exceed the actual amount of random-access memory available to the process, and it is usually more important to minimize the number of page faults than the virtual memory required by the process. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1988
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1988220404871